On the Diaconis-Shahshahani Method in Random Matrix Theory
نویسنده
چکیده
If is a random variable with values in a compact matrix group K , then the traces Tr( j ) ( j ∈ N) are real or complex valued random variables. As a crucial step in their approach to random matrix eigenvalues, Diaconis and Shahshahani computed the joint moments of any fixed number of these traces if is distributed according to Haar measure and if K is one of Un, On or Spn , where n is large enough. In the orthogonal and symplectic cases, their proof is based on work of Ram on the characters of Brauer algebras. The present paper contains an alternative proof of these moment formulae. It invokes classical invariant theory (specifically, the tensor forms of the First Fundamental Theorems in the sense of Weyl) to reduce the computation of matrix integrals to a counting problem, which can be solved by elementary means.
منابع مشابه
Second Order Freeness and Fluctuations of Random Matrices: Ii. Unitary Random Matrices
We extend the relation between random matrices and free probability theory from the level of expectations to the level of fluctuations. We show how the concept of “second order freeness”, which was introduced in Part I, allows one to understand global fluctuations of Haar distributed unitary random matrices. In particular, independence between the unitary ensemble and another ensemble goes in t...
متن کاملAverages over classical Lie groups, twisted by characters
We compute EG( ∏ i tr(g λi )), where g ∈G = Sp(2n) or SO(m) (m = 2n, 2n+1) with Haar measure. This was first obtained by Diaconis and Shahshahani [Persi Diaconis, Mehrdad Shahshahani, On the eigenvalues of random matrices, J. Appl. Probab. 31A (1994) 49–62. Studies in applied probability], but our proof is more self-contained and gives a combinatorial description for the answer. We also conside...
متن کاملA Markov chain on the symmetric group and Jack symmetric functions
Hanlon, P., A Markov chain on the symmetric group and Jack symmetric functions, Discrete Mathematics 99 (1992) 123-140. Diaconis and Shahshahani studied a Markov chain Wf(l) whose states are the elements of the symmetric group S,. In W,(l), you move from a permutation n to any permutation of the form a(i, j) with equal probability. In this paper we study a deformation W,(a) of this Markov chain...
متن کاملGenerating Random Elements in SLn (Fq) by Random Transvections
Abstract. This paper studies a random walk based on random transvections in SLn(Fq,) and shows that, given 6 > 0, there is a constant c such that after n + c steps the walk is within a distance e from uniform and that after nc steps the walk is a distance at least 1 e from uniform. This paper uses results of Diaconis and Shahshahani to get the upper bound, uses results of Rudvalis to get the lo...
متن کامل06 Mixing times via super - fast coupling
We provide a coupling proof that the transposition shuffle on a deck of n cards is mixing of rate n log(n) with a moderate constant. This has already been shown by Diaconis and Shahshahani but no natural coupling proof has been demonstrated to date. We also enlarge the methodology of coupling to include intuitive but nonadapted coupling rules, for example, to take in account future events and t...
متن کامل